Statistical search range adaptation solution for effective frame rate up‐conversion
نویسندگان
چکیده
منابع مشابه
ERA: Effective Rate Adaptation for WLANs
Rate adaptation consists of using the optimal rate for a given channel quality: the poorer the channel quality, the lower the rate should be. Multiple rate adaptation schemes were proposed and studied so far. The first generation rate adaptation schemes perform well in collision free environments and manage quite well strict channel degradation. Under a congestion dominated environment, these s...
متن کاملFrame-period adaptation for speaking rate robust speech recognition
This paper describes a frame-period adaptation method for speaking rate robust speech recognition. The proposed method determines an appropriate frame-period for each phrase by measuring its speaking rate or computing the acoustic likelihood with a set of frame-periods. Experimental results on spontaneous speech recognition show that the proposed method is effective for slower utterance. Actual...
متن کاملE: Energy-Efficient Engine for Frame Rate Adaptation on Smartphones
Touch-screen technique has gained the large popularity in human-screen interaction with modern smartphones. Due to the limited size of equipped screens, scrolling operations are indispensable in order to display the content of interest on screen. While power consumption caused by hardware and software installed within smartphones is well studied, the energy cost made by human-screen interaction...
متن کاملDesigning an Effective Enterprise Search Solution
The Google Search Appliance provides quite a few traditionally requested enterprise search features out-of-the-box (OOTB). Even though the appliance fits the hardware plug-and-play model, it provides a flexible framework for integrating with external systems such as content management systems, document management systems, security systems, federated search and both Google and non-Google service...
متن کاملEffective Nearest Neighbor Search for Aligning and Merging Range Images
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many of the leaf nodes must be examined during the search, which actually will not finish in logarithmic time. However, such a distant point is not as important as the nearest neighbor in many applications, such as alignin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Image Processing
سال: 2018
ISSN: 1751-9667,1751-9667
DOI: 10.1049/iet-ipr.2016.0938